Communication device employing binary product coding with selective additional Cyclic Redundancy Check (CRC) therein

ABSTRACT

Communication device employing binary product coding with selective additional cyclic redundancy check (CRC) therein. Product code encoding (e.g., employing row and column encoding of matrix formatted bits, selectively with interleaving and/or permutation of the bits therein) may be combined with additional error correction code (ECC) or forward error correction (FEC) coding thereby generating coded bits for use in generating a signal to be launched into a communication channel. Various ECCs/FECs may be employed including a BCH (Bose and Ray-Chaudhuri, and Hocquenghem) code, a Reed-Solomon (RS) code, an LDPC (Low Density Parity Check) code, etc. The redundancy of such coded signals as generated using the principles herein is in the range of approximately 7%, and hard decision decoding may be performed on such coded signals generated herein. In accordance with decoding such signals, various bit decisions (within certain iterations) may be selectively ignored and/or reverted back to previous bit decisions.

CROSS REFERENCE TO RELATED PATENTS/PATENT APPLICATIONS ProvisionalPriority Claims

The present U.S. Utility Patent Application claims priority pursuant to35 U.S.C. §119(e) to the following U.S. Provisional Patent Applicationswhich are hereby incorporated herein by reference in their entirety andmade part of the present U.S. Utility Patent Application for allpurposes:

1. U.S. Provisional Application Ser. No. 61/161,030, entitled “Forwarderror correction (FEC) scheme for communications,” (Attorney Docket No.BP20232), filed Mar. 17, 2009, pending.

2. U.S. Provisional Application Ser. No. 61/170,593, entitled“Communication device employing binary product coding with selectiveadditional cyclic redundancy check (CRC) therein,” (Attorney Docket No.BP20522), filed Apr. 17, 2009, pending.

INCORPORATION BY REFERENCE

The following U.S. Utility Patent Application is hereby incorporatedherein by reference in its entirety and is made part of the present U.S.Utility Patent Application for all purposes:

1. U.S. Utility application Ser. No. 12/725,887, entitled “Forward errorcorrection (FEC) scheme for communications,” (Attorney Docket No.BP20232), filed concurrently on Mar. 17, 2010, pending, which claimspriority pursuant to 35 U.S.C. §119(e) to the following U.S. ProvisionalPatent Application which is hereby incorporated herein by reference inits entirety and made part of the present U.S. Utility PatentApplication for all purposes:

-   -   a. U.S. Provisional Application Ser. No. 61/161,030, entitled        “Forward error correction (FEC) scheme for communications,”        (Attorney Docket No. BP20232), filed Mar. 17, 2009, pending.

BACKGROUND OF THE INVENTION

1. Technical Field of the Invention

The invention relates generally to communication devices; and, moreparticularly, it relates to communication devices that employ binaryproduct coding with selective additional cyclic redundancy check (CRC)therein.

2. Description of Related Art

Data communication systems have been under continual development formany years. One such type of communication system that has been ofsignificant interest lately is a communication system that employsiterative error correction codes (ECCs) that operate in accordance withforward error correction (FEC). There are a variety of types of ECCsincluding Reed-Solomon (RS) code, turbo codes, turbo trellis codemodulation (TTCM) code, LDPC (Low Density Parity Check) code, etc.Communications systems with iterative codes are often able to achievelower bit error rates (BER) than alternative codes for a given signal tonoise ratio (SNR).

A continual and primary directive in this area of development has beento try continually to lower the SNR required to achieve a given BERwithin a communication system. The ideal goal has been to try to reachShannon's limit in a communication channel. Shannon's limit may beviewed as being the data rate to be used in a communication channel,having a particular SNR, that achieves error free transmission throughthe communication channel. In other words, the Shannon limit is thetheoretical bound for channel capacity for a given modulation and coderate.

Generally speaking, within the context of communication systems thatemploy ECCs, there is a first communication device at one end of acommunication channel with encoder capability and second communicationdevice at the other end of the communication channel with decodercapability. In many instances, one or both of these two communicationdevices includes encoder and decoder capability (e.g., within abi-directional communication system). ECCs can be applied in a varietyof additional applications as well, including those that employ someform of data storage (e.g., hard disk drive (HDD) applications and othermemory storage devices) in which data is encoded before writing to thestorage media, and then the data is decoded after being read/retrievedfrom the storage media.

BRIEF SUMMARY OF THE INVENTION

The present invention is directed to apparatus and methods of operationthat are further described in the following Brief Description of theSeveral Views of the Drawings, the Detailed Description of theInvention, and the claims. Other features and advantages of the presentinvention will become apparent from the following detailed descriptionof the invention made with reference to the accompanying drawings.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 and FIG. 2 illustrate various embodiments of communicationsystems.

FIG. 3 illustrates an embodiment of an apparatus that is operative toperform matrix formatting and product code encoding.

FIG. 4 and FIG. 5 illustrate embodiments of row and column encoding ofmatrix formatted bits, respectively.

FIG. 6 illustrates an alternative embodiment of row and column encodingof matrix formatted bits.

FIG. 7 illustrates an alternative embodiment of an apparatus that isoperative to perform matrix formatting and product code encoding.

FIG. 8 illustrates an embodiment of systematic bit encoding of variousbit groups using a common code for all bit groups.

FIG. 9 illustrates an alternative embodiment of systematic bit encodingof various bit groups using two or more codes for the various bitgroups.

FIG. 10 illustrates an alternative embodiment of systematic bit encodingof various bit groups using two or more codes for the various bitgroups.

FIG. 11 illustrates an alternative embodiment of a communication system.

FIG. 12 illustrates an embodiment of product code configurations.

FIG. 13 illustrates an embodiment of the iterative decoding flow forgeneral product codes.

FIG. 14 and FIG. 15 illustrate an embodiment of the iterative modifieddecoding flow for general product codes.

FIG. 16A illustrates an embodiment of method for performing receiverprocessing of a signal received from a communication channel.

FIG. 16B and FIG. 16C illustrate embodiment of various methods forperforming receiver processing of a signal received from a communicationchannel and reverting of bit values from previous decoding iterations.

FIG. 17A illustrates an embodiment of a method for performing productencoding involving including cyclic redundancy check (CRC) therein.

FIG. 17B illustrates an embodiment of a method for decoding processingof a product coded signal.

DETAILED DESCRIPTION OF THE INVENTION

The goal of digital communications systems is to transmit digital datafrom one location, or subsystem, to another either error free or with anacceptably low error rate. As shown in FIG. 1, data may be transmittedover a variety of communications channels in a wide variety ofcommunication systems: magnetic media, wired, wireless, fiber, copper,and other types of media as well.

FIG. 1 and FIG. 2 illustrate various embodiments of communicationsystems, 100 and 200, respectively.

Referring to FIG. 1, this embodiment of a communication system 100 is acommunication channel 199 that communicatively couples a communicationdevice 110 (including a transmitter 112 having an encoder 114 andincluding a receiver 116 having a decoder 118) situated at one end ofthe communication channel 199 to another communication device 120(including a transmitter 126 having an encoder 128 and including areceiver 122 having a decoder 124) at the other end of the communicationchannel 199. In some embodiments, either of the communication devices110 and 120 may only include a transmitter or a receiver. There areseveral different types of media by which the communication channel 199may be implemented (e.g., a satellite communication channel 130 usingsatellite dishes 132 and 134, a wireless communication channel 140 usingtowers 142 and 144 and/or local antennae 152 and 154, a wiredcommunication channel 150, and/or a fiber-optic communication channel160 using electrical to optical (E/O) interface 162 and optical toelectrical (O/E) interface 164)). In addition, more than one type ofmedia may be implemented and interfaced together thereby forming thecommunication channel 199.

To reduce transmission errors that may undesirably be incurred within acommunication system, error correction and channel coding schemes areoften employed. Generally, these error correction and channel codingschemes involve the use of an encoder at the transmitter and a decoderat the receiver.

Any of the various types of coding described herein can be employedwithin any such desired communication system (e.g., including thosevariations described with respect to FIG. 1), any information storagedevice (e.g., hard disk drives (HDDs), network information storagedevices and/or servers, etc.) or any application in which informationencoding and/or decoding is desired.

Referring to the communication system 200 of FIG. 2, at a transmittingend of a communication channel 299, information bits 201 are provided toa transmitter 297 that is operable to perform encoding of theseinformation bits 201 using an encoder and symbol mapper 220 (which maybe viewed as being distinct functional blocks 222 and 224, respectively)thereby generating a sequence of discrete-valued modulation symbols 203that is provided to a transmit driver 230 that uses a DAC (Digital toAnalog Converter) 232 to generate a continuous-time transmit signal 204and a transmit filter 234 to generate a filtered, continuous-timetransmit signal 205 that substantially comports with the communicationchannel 299. The transmit driver 230 may perform any necessary front endprocessing of a signal received from a communication channel (e.g.,including any one or digital to analog conversion, gain adjustment,filtering, frequency conversion, etc.) to generate the filtered,continuous-time transmit signal 205.

At a receiving end of the communication channel 299, continuous-timereceive signal 206 is provided to an AFE (Analog Front End) 260 thatincludes a receive filter 262 (that generates a filtered,continuous-time receive signal 207) and an ADC (Analog to DigitalConverter) 264 (that generates discrete-time receive signals 208). TheAFE 260 may perform any necessary front end processing of a signalreceived from a communication channel (e.g., including any one or analogto digital conversion, gain adjustment, filtering, frequency conversion,etc.) to generate a digital signal provided to a metric generator 270that generates a plurality of metrics corresponding to a particular bitor symbol extracted from the received signal. The metric generator 270calculates metrics 209 (e.g., on either a symbol and/or bit basis) thatare employed by a decoder 280 to make best estimates of thediscrete-valued modulation symbols and information bits encoded therein210.

The decoders of either of the previous embodiments may be implemented toinclude various aspects and/or embodiment of the invention therein. Inaddition, several of the following figures describe other and particularembodiments (some in more detail) that may be used to support thedevices, systems, functionality and/or methods that may be implementedin accordance with certain aspects and/or embodiments of the invention.

It is noted that various types of error correction codes (ECCs) may beemployed herein. For example, any one or more of any type or variant ofReed-Solomon (RS) code, turbo code, turbo trellis code modulation (TTCM)code, LDPC (Low Density Parity Check) code, BCH (Bose and Ray-Chaudhuri,and Hocquenghem) code, etc. Moreover, as will be seen in variousembodiments herein, more than one ECC and/or more than one type of ECCmay be employed when generating a single encoded signal in accordancewith the principles presented herein. For example, certain of theembodiments presented herein operate as product codes, in which an ECCis employed more than once or more than one type of ECC is employed(e.g., a first ECC during a first time and a second ECC at a secondtime) to generate an encoded signal.

Moreover, it is noted that both systematic encoding and non-systematicencoding may be performed in accordance with the various principlespresented herein. Systematic encoding preserves the information bitsbeing encoded and generates corresponding redundancy/parity bits (i.e.,redundancy and parity may be used interchangeably herein); for example,the information bits being encoded are explicitly shown/represented inthe output of non-systematic encoding. Non-systematic encoding does notnecessarily preserve the information bits being encoded and generatescoded bits that inherently include redundancy parity informationtherein; for example, the information bits being encoded need not beexplicitly shown/represented in the output of non-systematic encoding.While many of the embodiments shown herein refer to systematic encoding,it is note that non-systematic encoding may alternatively, be performedin any embodiment without departing from the scope and spirit of theinvention.

Certain embodiments of communication device and methods operating inaccordance with the principles presented herein are designed to maximizecoding gain as high as possible while maintaining a reasonable oracceptable hardware complexity and power consumption. Moreover, certainembodiments (e.g., to be compliant in accordance with a certain standardor communication protocol), certain constraints such as bit error rate(BER) or block error rate (BLER), redundancy rate or code rate, bitrates, throughput, etc.

For example, one embodiment that operates in accordance with a 100 Gbps(Giga-bits per second) bit rate targets a BER in the range of 1×10⁻¹⁴ or1×10⁻¹⁵, and has a fixed redundancy rate of 16/239 or 6.69%.

FIG. 3 illustrates an embodiment of an apparatus 300 that is operativeto perform matrix formatting and product code encoding. In thisembodiment, an information bit sequence (e.g., including bits 1 throughn as depicted by b(1), b(2), and so on up to b(n)) is provided to amatrix formatting module 310. The matrix formatting module 310 operatesby selecting/arranging the information bit sequence into a desiredformat/pattern. For example, the information bit sequence may be firstlyarranged into information bit groups (e.g., first information bit groupincluding bits b(1) through b(x), second information bit group includingbits b(x+1) through b(2 x), and so on until an m-th information bitgroup including bits b((m−1)x+1) through b(n)[end of originalinformation bit sequence]), and each information bit group then isarranged appropriately into rows (e.g., row placement) therebygenerating matrix formatted bits.

An encoder 320 selectively encodes the matrix formatted bits therebygenerating encoded bits (e.g., an encoded bit sequence). For example,parity bits corresponding to the matrix formatted bits are generated inaccordance with encoding.

In some embodiments, the encoder 320 is a product code encoder 320 a. Aproduct code encoder may be viewed as being a two dimensional encoderthat operates in a first dimension, and then operates in a seconddimension. Each of these two dimensions may employ a common ECC, or theymay employ different ECCs. In even another embodiment, differentrespective ECCs may be employed for the respective rows and/or columnsof the matrix formatted bits. In one embodiment, the first dimension isperformed using a row encoder 321 a, and the second dimension isperformed using a column encoder 322 a.

It is noted that a common ECC may be employed when encoding the separaterows of bits within the matrix formatted bits; alternatively, differentECCs may be employed when encoding the various rows of bits within thematrix formatted bits. Similarly, a common ECC may be employed whenencoding the separate columns of bits within the matrix formatted bits;alternatively, different ECCs may be employed when encoding the variouscolumns of bits within the matrix formatted bits.

FIG. 4 and FIG. 5 illustrate embodiments, 400 and 500, respectively, ofrow and column encoding of matrix formatted bits, respectively. Theseembodiments 400 and 500 depict systematic encoding, but again,non-systematic encoding can be employed in alternative embodimentswithout departing from the scope and spirit of the invention.

Referring to embodiment 400 of FIG. 4, an information bit row/group 1(R1) shown as including bits b(1) through b(x) undergo encoding inaccordance with an ECC to generate parity bit row/group 1 (P(R1)). Foreach of the other rows of the matrix formatted bits (e.g., shown in FIG.3), the corresponding information bit row/group undergoes encoding inaccordance with an ECC to generate a corresponding parity bit row/group.

Referring to embodiment 500 of FIG. 5, an information bit column/group 1(C1) shown as including bits b(1) through b((m−1)x+1) undergo encodingin accordance with an ECC to generate parity bit column/group 1 (P(C1)).For each of the other columns of the matrix formatted bits (e.g., shownin FIG. 3), the corresponding information bit column/group undergoesencoding in accordance with an ECC to generate a corresponding paritybit column/group.

FIG. 6 illustrates an alternative embodiment 600 of row and columnencoding of matrix formatted bits. The embodiment 600 shows therelationship between matrix formatted bits and the parity bits generatedin accordance with row encoding and column encoding.

As can be seen when comparing the matrix formatted bits on the left handside with the resulting encoded matrix on the right hand side, thematrix formatted bits is included in the resulting encoded matrix alongwith parity bits generated in accordance with row encoding (i.e.,located to the right hand side of the matrix formatted bits, shown asincluding s parity bits each) as well as parity bits generated inaccordance with column encoding (i.e., located below the matrixformatted bits, shown as including t parity bits each). It is noted thatt may equal s in some embodiments, or t may be different be differentvalues in other embodiments.

It is also noted that column encoding may subsequently be performed onthe parity bits generated in accordance with row encoding to generateadditional parity bits included below those parity bits (i.e., locatedin lower right hand corner of the resulting encoded matrix).Alternatively, it is also noted that row encoding may subsequently beperformed on the parity bits generated in accordance with columnencoding to generate parity bits included to the right hand side ofthose parity bits (i.e., located in lower right hand corner of theresulting encoded matrix).

In an even alternative embodiment, a combination of column encodingperformed on the parity bits generated in accordance with row encodingand column encoding (i.e., some of the parity bits located in lowerright hand corner of the resulting encoded matrix may be generated byencoding the parity bits located above and some of the parity bitslocated in lower right hand corner of the resulting encoded matrix maybe generated by encoding the parity bits located to the left). In evenanother embodiment, it is also possible to have all of the generatedparity bits from row encoding and column encoding appended after thesource data sequence.

FIG. 7 illustrates an alternative embodiment of an apparatus 700 that isoperative to perform matrix formatting and product code encoding. Thisembodiment is somewhat analogous to the apparatus 300 of FIG. 3 with atleast one difference being that the resulting matrix formatted bits arearranged in accordance with column placement.

In this embodiment, an information bit sequence (e.g., including bits 1through n as depicted by b(1), b(2), and so on up to b(n)) is providedto a matrix formatting module 710. The matrix formatting module 710operates by selecting/arranging the information bit sequence into adesired format/pattern. For example, the information bit sequence may befirstly arranged into information bit groups (e.g., first informationbit group including bits b(1) through b(x), second information bit groupincluding bits b(x+1) through b(2 x), and so on until an nth informationbit group including bits b((m−1)x+1) through b(n)[end of originalinformation bit sequence]), and each information bit group then isarranged appropriately into columns (e.g., column placement) therebygenerating matrix formatted bits.

An encoder 720 selectively encodes the matrix formatted bits therebygenerating encoded bits (e.g., an encoded bit sequence). For example,parity bits corresponding to the matrix formatted bits are generated inaccordance with encoding.

In some embodiments, the encoder 720 is a product code encoder 720 a. Aproduct code encoder may be viewed as being a two dimensional encoderthat operates in a first dimension, and then operates in a seconddimension. Each of these two dimensions may employ a common ECC, or theymay employ different ECCs. In one embodiment, the first dimension isperformed using a row encoder 721 a, and the second dimension isperformed using a column encoder 722 a.

Again, it is noted that a common ECC may be employed when encoding theseparate rows of bits within the matrix formatted bits; alternatively,different ECCs may be employed when encoding the various rows of bitswithin the matrix formatted bits. Similarly, a common ECC may beemployed when encoding the separate columns of bits within the matrixformatted bits; alternatively, different ECCs may be employed whenencoding the various columns of bits within the matrix formatted bits.

FIG. 8 illustrates an embodiment 800 of systematic bit encoding ofvarious bit groups using a common code for all bit groups. Informationbits are provided to an encoder 810 and encoded bits are output therefrom (i.e., information bits+redundancy/parity bits in a systematicencoding embodiment).

The information bits are firstly arranged into information bit groups(e.g., first information bit group (G0) including x bits, secondinformation bit group (G1) including x bits, and so on up to informationbit group (Gn) including x bits).

Each of the information bit groups undergoes encoding using a common ECCto generate corresponding parity bit groups (each including y bits).Certain of the generated coded bits (e.g., information bits+parity bits)are arranged and undergo row encoding. Other of the generated coded bits(e.g., information bits+parity bits) are arranged and undergo columnencoding.

FIG. 9 illustrates an alternative embodiment 900 of systematic bitencoding of various bit groups using two or more codes for the variousbit groups.

Information bits are provided to a multi-code encoder 910 and encodedbits are output there from (i.e., information bits+redundancy/paritybits in a systematic encoding embodiment). The multi-code encoder 910includes and is operative to employ a different ECC at different timesto encode different information bits.

The information bits are firstly arranged into information bit groups(e.g., first information bit group (G0) including x bits, secondinformation bit group (G1) including x bits, and so on up to informationbit group (Gn) including x bits).

Each of the information bit groups undergoes encoding using a respectiveECC to generate corresponding parity bit groups. For example, the firstcoded bits includes information bit group (G0) (x bits) and parity bitgroup P0 (y1 bits). The second coded bits includes information bit group(G1) (x bits) and parity bit group P1 (y1 bits). The first coded bitsand the second coded bits are generated using a first ECC (e.g., each ofthe information bit groups (G0) and (G1) including a same number ofbits, and each of the parity bit groups (P0) and (P1) also including arespective same number of bits). However, in this embodiment using amulti-code encoder 910, the coded bits including information bit group(Gn) (x bits) undergo encoding thereby generating parity bit group Pn(yn bits); these information bit group (Gn) (x bits) bits are generatedusing a second ECC (e.g., that has a different amount of redundancy thatthe first ECC used to generate the parity bit groups (P0) and (P1)).

If desired, to ensure that a same number of bits are included withineach information bit group and each parity bit group (or for any otherpurpose, e.g., to ensure the overall coded bits meet some constraint orrequirement), fill bits may be employed. The placement of these fillbits may be anywhere within that respective sequence (e.g., at the end,at the beginning, interspersed therein in accordance with some pattern).The fill bits may be all zero-valued bits, they may be cyclic redundancycheck (CRC) bits, checksum/parity bits, special flag bits to indicate anoccurrence of some issue, etc.). In particular, these fill bits may beinserted before encoding or after encoding for one or more of the codegroups.

FIG. 10 illustrates an alternative embodiment 1000 of systematic bitencoding of various bit groups using two or more codes for the variousbit groups.

Information bits are provided to a multi-code encoder 1010 and encodedbits are output there from (i.e., information bits+redundancy/paritybits in a systematic encoding embodiment). The multi-code encoder 1010includes and is operative to employ a different ECC at different timesto encode different information bits.

The information bits are firstly arranged into information bit groups(e.g., first information bit group (G0) including x1 bits, secondinformation bit group (G1) including x2 bits, and so on up toinformation bit group (Gn) including xn bits).

The first coded bits includes information bit group (G0) (x1 bits) andparity bit group P0 (y1 bits) as generated by a first ECC. The secondcoded bits includes information bit group (G1) (x2 bits) and parity bitgroup P1 (y2 bits) as generated by a second ECC. The nth coded bitsincludes information bit group (Gn) (xn bits) and parity bit group Pn(yn bits) as generated by an nth ECC.

If desired, to ensure that a same number of bits is included within eachinformation bit group and each parity bit group (or for any otherpurpose, e.g., to ensure the overall coded bits meet some constraint orrequirement), fill bits may be employed. The placement of these fillbits may be anywhere within that respective sequence (e.g., at the end,at the beginning, interspersed therein in accordance with some pattern).The fill bits may be all zero-valued bits, they may be cyclic redundancycheck (CRC) bits, checksum/parity bits, special flag bits to indicate anoccurrence of some issue, etc. The fill bits may be different in each ofthe respective coded bit groups, and certain of the coded bit groups mayinclude no fill bits whatsoever.

Herein, a series of product codes (i.e., a product code is a novel typeof forward error correction (FEC) code) may be applied forconsideration, among other protocols and/or standards, of the ITU-T 100Gb/s standards. These product codes are alternatively referred to asSP-BCH code, where SP can be viewed as being interpreted as “SuperProduct” or “Simple Product”.

All product codes presented here consist of row component codes andcolumn component codes. Either component code is a BCH code (e.g., a BCHcode is a code as invented independently by (1) Hocquenghem and by (2)Bose and Ray-Chaudhuri—which may generally be referred to as a BCH(Bose, Ray-Chaudhuri, Hocquenghem) code). To reduce false detectionprobability, one or more extra control bits may be added after sourcedata before (and/or after) encoding. For instance, BCH(1022,991)×BCH(1022, 990) is a kind of product code, where for row codes, 1extra bit may be added (i.e., this extra bit can be a parity bit fromthe source data or a bit from a cyclic redundancy check (CRC) checksumor a kind of control bit to be decided based on various codingconditions). For easier hardware implementation in certain embodiments,interleaving should only be considered inside each row or inside eachcolumn, but not both for certain embodiments of product codes.

FIG. 11 illustrates an alternative embodiment of a communication system1100. Information bits 1101 a are provided to a product code encoder1105 a. In some embodiments, the coding employed by the product codeencoder 1105 a may be a SP-BCH code. In accordance with performingproduct code encoding, the product code encoder 1105 a may also includecontrol bit functionality 1110 a that is selectively operative to addone or more extra or control bits in accordance with the product codeencoding within the product code encoder 1105 a. These one or more extraor control bits may be any desired form as desired in any particularembodiment (e.g., CRC, control bit, parity bit of source data, etc.). Ofcourse, in some embodiments, no extra or control bits are added by thecontrol bit functionality 1110 a within the product code encoder 1105 a.The operations as performed by the control bit functionality 1110 awithin the product code encoder 1105 a may be in accordance with any ofthe variants, embodiments, or equivalences as described herein (e.g.,such as adding 2 extra bits to both row codes and column codes, adding 1extra bit to all (or at least one of) row codes and add 2 extra bits toall (or at least one of) column codes, adding 2 extra bits to all (or atleast one of) row codes and add 1 extra bit to all (or at least one of)column codes, and/or adding 1 extra bit to both row codes and columncodes, and/or in accordance with any other desired manner, etc.).

The resulting coded bits (e.g., product coded bits which may include oneor more extra or control bits) are provided from the product codeencoder 1105 a to an interleaver (t)/symbol mapper 1120 a implemented toperform any desired combination of interleaving and symbol mapping(which may symbol map different symbols to different modulations (i.e.,constellations with respective mappings of the constellation pointstherein).

A modulator 1130 a (e.g., which may be viewed as being an embodiment ofa transmit driver) performs any necessary modification (e.g., frequencyconversion, gain adjustment, filtering, etc.) to the discrete sequenceof symbols output from the interleaver (t)/symbol mapper 1120 a togenerate a continuous time signal that comports with the characteristicsof communication channel 1199 (e.g., including filtering, digital toanalog conversion, frequency conversion, gain adjustment, etc.).

A demodulator 1130 b receives the signal from the communication channel1199 (e.g., the signal may have incurred certain effects includingnoise, etc.) and perform demodulation thereon. This may involve thecalculation of certain metrics (e.g., by a metric generator 1131 b) andsymbol de-mapping (e.g., by a symbol de-mapper 1121 b) for use insubsequent decoding. This may also involve any other demodulationfunction (e.g., as shown by reference numeral 1139 b) includingfiltering, analog to digital conversion, frequency conversion, gainadjustment, etc.

After undergoing the demodulation operations, the bit sequence generatedthere from undergoes de-interleaving in de-interleaver (π⁻¹) 1122 b.Thereafter, a product code decoder 1105 b, that corresponds to the typeof code employed within the product code encoder 1105 a, is operative toprocess the signal output from the de-interleaver (π⁻¹) 1122 b.Estimates of the original information bits 1101 b are output from theproduct code decoder 1105 b. The product code decoder 1105 b may includecontrol bit functionality 1110 b to operate and process any one or moreextra or control bits that may have been included in accordance with theproduct code decoder 1105 a within the product code encoder 1105 a.These added control or extra bits will be used to reduce false errorcorrection probability.

With respect to the embodiment of FIG. 11, the Applicant alsorespectfully points out that a matrix formatting module 1199 a may beimplemented within a transmitter communication device (that may includeall of the components shown before the communication channel 1199) at afirst end of the communication channel 1199, and a matrix formattingmodule 1199 b may be implemented within a receiver communication device(that may include all of the components shown after the communicationchannel 1199) at a second end of the communication channel 1199. Therespective matrix formatting modules 1199 a and 1199 b are operative toperform formatting of information bits, coded bits, interleaved bits,control bits, etc. based on matrix formatting in accordance with theprinciples described herein as well as perform coordination between oneor more of the various modules within the respective transmitter andreceiver communication devices, respectively. In certain embodiments,the matrix formatting module 1199 a may be communicatively coupled toone or more of the components shown within a transmitter device, and thematrix formatting module 1199 b may be communicatively coupled to one ormore of the components shown within a receiver device. The respectivematrix formatting modules 1199 a and 1199 b may also operate inaccordance with coordination among one another without departing fromthe scope and spirit of the invention. In this embodiment, as well asother embodiments described herein, various embodiments may include moreor fewer modules and/or functional blocks without departing from thescope and spirit of the invention.

FIG. 12 illustrates an embodiment 1200 of product code configurations.FIG. 12 shows two simple examples. In either case of this embodiment1200, there are 7 rows and 7 columns. In practice, the number of rowsdoesn't have to be the same as that of the number of columns. In theleft hand side of FIG. 12 (a), there's no interleaving in either row orcolumn directions. In the right hand side of FIG. 12 (b), each row iscyclically shifted. For instance, for 3^(rd) row, the element 15 will bethe first bit to the input of the row encoder. Accordingly, element 16will be the 2^(nd) bit to the encoder of that row code. To reduceencoding latency, only intra-row permutation may be employed in certainembodiments. For a relatively straightforward hardware implementation,cyclically shifting of the row elements as an optional interleavingscheme may be performed, e.g., shift 1 bit every row, or shift 2 bitsevery 2 rows as shown in the right hand side of FIG. 12 (b).

If BCH codes are employed with a small t (error correct capability),e.g., t<=4, additional redundancy (e.g., in form of CRC) may be includedby adding 1 or 2, or even up to 3 extra bits after source data before(and/or after) encoding in order to reduce false error correctionpossibility. In practice, adding 3 extra bits is not suggested in apreferred embodiment. So there may be 4 different combinations:

Case-I: add 2 extra bits to both row codes and column codes,

Case-II: add 1 extra bit to all (or at least one of) row codes and add 2extra bits to all (or at least one of) column codes,

Case-III: add 2 extra bits to all (or at least one of) row codes and add1 extra bit to all (or at least one of) column codes,

Case-IV: add 1 extra bit to both row codes and column codes.

Though various possible schemes and embodiments exist, for a relativelysimple hardware implementation, the following scheme is preferred in oneembodiment:

1. To add 1 extra bit, use even or odd parity bit of source data of thecode group,

2. To add 2 extra bits, use 2-bit checksum of the source data of thecode group going through a CRC check circuit with polynomial of x²+x+1.

Other possibilities include, but not limited:

1) To add 1 parity bit, first set this 1 bit as 1 to encode it, andcompute even or odd parity for the entire encoded group, and then setthis extra bit as 0, encode it and compute same parity of the encodedgroup. The extra bit can be decided to be 1 or 0 based on the specificBCH codes being used and the above 2 possible encoding results.Moreover, either a first bit or a second bit such as that may begenerated using control bit functionality included within a product codeencoder (e.g., implemented to perform 2-bit CRC check calculations) canbe employed in such an embodiment.

2) To add 2 extra bits, first extra bit can be generated as a kind ofparity of a portion of source data, or 1-bit out of 2-bit or 3-bit CRCchecksum. Then, 2^(nd) extra bits can be added as did for adding (only)1 extra bit.

For ITU-T FEC, the code redundancy is fixed as 6.69%. The followingoptions may be considered:

Type-Ia: row code BCH(992, 960, t=3), column code BCH (1020, 988, t=3),there are 128 spare bits. They can be used as multiple CRC checksums orother purposes. The frame size is 31 times of 32640.

Type-Ib: row code BCH(988, 956, t=3), column code BCH (1020, 988, t=3),there is no spare bits. The frame size is not a multiple of 32640.

Type-II: row code BCH(987, 956, t=3), column code BCH(992, 960, t=3),there're 96 spare bits, which can be used as multiple CRC checksum orany other purpose to increase false detection capability and/or assistin error correction. The frame size is 30 times of 32640.

Type-III: row code BCH(988, 956, t=3), column code BCH(991, 960, t=3),there're 92 spare bits, which can be used as multiple CRC checksum orany other purpose to increase false detection capability and/or assistin error correction. The frame size is 30 times of 32640.

Type-IV: row code BCH(987, 956, t=3), column code BCH(959, 928, t=3),there're 27 spare bits.

Cyclically shifting row elements before encoding is optional for each ofthe above types. This can help hardware implementation and improveperformance as well with proper shifting.

Our simulations show that for additive white Gaussian noise (AWGN)channel, binary phase shift keying (BPSK) modulation, Type-II code canachieve BER<5×10⁻¹⁰ at Eb/No=5.62 dB at 9 iterations. A BER=1×10⁻¹⁵ maybe expected to be achieved at Eb/No=5.64 dB at 11 iterations orEb/No=5.63 dB at 12 iterations.

In brief, the code has a net coding gain (NCG) of at least 15−5.63=9.37dB (note: another candidate code may have a NCG of 9.35 dB at max of 30iterations). If only 2 iterations are run, the NCG will be at least15.0−8.0=7.0 dB at target BER=1×10⁻¹⁵ (the other mentioned code has aNCG of 6.7 dB at 2 iterations).

Decoding Scheme for Generic Product Codes:

For a binary product code as discussed above, decoding is generallystarted on column (or row) decoding, then row (or column) decoding and anumber of decoding iterations are performed. To improve decodingperformance, some of previous decoding results may be ignored asfollows:

a) in column decoding phase, if a column code is deemed as un-decodable,the result from the previous decoding iteration of column decoding iscompletely or partially recovered while ignoring the preceding iterationof row decoding effect on this column code.

b) in row decoding phase, if a row code is deemed as un-decodable, theresult from the previous iteration of row decoding is completely orpartially recovered while completely or partially ignoring precedingiteration of column decoding effect on this row code.

Although this new decoding scheme will typically require some additionalhardware in decoding, it can save approximately 3 iterations for a lowtarget BER, which will ease real hardware implementation significantlyfor high speed applications and also provide for a savings in powerconsumption (such as may be highly desirable in embodiments seeking toeffectuate energy conservation).

Memory Access Schemes for High-Speed Product Codes:

Decoding Scheme for Generic Product Codes:

FIG. 13 illustrates an embodiment 1300 of the iterative decoding flowfor general product codes. A memory with multiple memory banks may beimplemented column-wise. Similarly, row-wise memory banks may beimplemented as well. For simplicity, the solution based on column-wisememory banks is discussed here, though the reader is reminded that thisapproach may also be applied using row-wise memory banks withoutdeparting from the scope and spirit of the invention.

Input data is sent to the memory, and column decoding is started at thesame time. Then, the decoding operates to update the bits column-wise.Later, the data may be sent to row decoders in a skewed way as shown inFIG. 13 with the arrowed lines. After row decoding, row decodingcorrection queue for column decoding is sent. The row decoding queuewill store bit locations for those bits that are corrected in thecurrent iteration of row decoding. When data for column decoding isread, some of the bits are flipped (0 flipped to 1, or vice versa) basedon the addresses provided by the queue. In the meantime, which bits wereflipped are recorded for each column code. After column decoding, thecolumn-wise based bits are updated based on the recorded data. Then, theiterative decoding process continues. It is also noted that the syndromecomputation for either row decoding or column decoding may be performedin an efficient manner. For instance, the syndromes can be updated foreach row code and each column code based on the most recently updatedbit locations instead of re-computing the syndromes anew within eachiteration.

FIG. 14 and FIG. 15 illustrate an embodiment 1400/1500 of the iterativemodified decoding flow for general product codes. Two single-portseparate memories are allocated. Initially input data is sent tocolumn-wise memory banks, immediately sent to row-wise memory banks in askewed way.

In the meantime, column code decoding begins. After that, columndecoding correction queue is ready for row decoding. The data is readrow-wise from row-wise memory banks. Again, some of the bits are flippedbased on column decoding correction queue before sending data to rowcode decoders. At the same time, which bits were flipped are recordedduring the time for each row code. After row decoding, the row decodingcorrection queue is sent for column decoding. In the meantime, therow-wise memory banks are updated based on the recorded flipped bits.Similar operations for decoding column codes are performed, and then,the iterative decoding process continues. While memory or memory banksare referred to here, it is of course noted that any desired form ofdata storage (e.g., one or more registers, random access memory,volatile memory, non-volatile memory, static memory, dynamic memory,flash memory, and/or any device that stores digital information) mayalternatively be employed without departing from the scope and spirit ofthe invention. As may be understood, certain storage devices (e.g.,register files) may have different (e.g., increased in the case ofregister files) real estate budgets, cost, etc. A designer has latitudeto use any such device that stores digital information for a particularembodiment without departing from the scope and spirit of the invention.

FIG. 16A illustrates an embodiment of method for performing receiverprocessing of a signal received from a communication channel. Referringto method 1600 of FIG. 16A, the method 1600 begins by receiving a signalfrom a communication channel, as shown in a block 1610. The method 1600continues by arranging a plurality of bits corresponding to the signalinto a plurality of matrix formatted bits in accordance with apredetermined pattern, as shown in a block 1620. The method 1600 thenoperates by operating a plurality of row decoders for decoding aplurality of rows of the plurality of matrix formatted bits therebygenerating estimates of information bits encoded within the plurality ofrows, as shown in a block 1630.

The method 1600 continues by operating a plurality of column decodersfor decoding a plurality of columns of the plurality of matrix formattedbits thereby generating estimates of information bits encoded within theplurality of columns, as shown in a block 1640. The method 1600 thenoperates by selectively recovering at least one estimate of informationbits encoded within a row (/ column) from at least one prior row (/column) decoding iteration for use in subsequent decoding performed bythe plurality of column decoders when the row or column being deemedun-decodable in a current decoding iteration, as shown in a block 1650.

FIG. 16B and FIG. 16C illustrate embodiment of various methods forperforming receiver processing of a signal received from a communicationchannel and reverting of bit values from previous decoding iterations.Referring to method 1601 of FIG. 16B, the method 1601 begins by within acurrent decoding iteration, determining that a row is deemedun-decodable, as shown in a block 1611. The method 1601 then operates byselectively reverting one or more bit values for the row from a previousrow decoding iteration for use in subsequent column decoding, as shownin a block 1621.

Referring to method 1602 of FIG. 16C, the method 1602 begins by within acurrent decoding iteration, determining that a column is deemedun-decodable, as shown in a block 1612. The method 1601 then operates byselectively reverting one or more bit values for the column from aprevious decoding iteration for use in subsequent row decoding, as shownin a block 1622.

In these embodiments, the value of one or more bits from the current row(/column) decoding iteration may be changed back to what it was during aprevious row (/ column) decoding iteration. In some instances, all ofthe bits in the row (/ column) that were corrected in the previouscolumn (/ row) decoding iteration, for that respective row (/ column),are merely reverted for use in subsequent decoding. Alternatively, asfew as one or more of the bits from the current decoding iteration arereverted for use in subsequent decoding.

FIG. 17A illustrates an embodiment of a method 1700 for performingproduct encoding involving including cyclic redundancy check (CRC)therein. Referring to method 1700 of FIG. 17A, the method 1700 begins byarranging a plurality of information bits into matrix formatted bits, asshown in a block 1710. This may be viewed arranging a bit sequence intorows and columns thereby generating the matrix formatted bits. Themethod 1700 continues by employing a first ECC for encoding rows ofmatrix formatted bits thereby generating first pluralities of paritybits, as shown in a block 1720. The method 1700 then operates byselectively adding one or more control or extra bits (e.g., CRC, controlbit, parity bit of source data, etc.) to at least one of the firstpluralities of parity bits, as shown in a block 1730.

The method 1700 continues by employing a second ECC for encoding columnsof matrix formatted bits thereby generating second pluralities of paritybits, as shown in a block 1740. In some embodiments, the first ECC andthe second ECC are the same ECC. In even other embodiments, differentECCs are respectively employed for encoding the different rows andcolumn of the matrix formatted bits thereby generating respectivepluralities of parity bits.

The method 1701 continues by selectively adding one or more control orextra bits (e.g., CRC, control bit, parity bit of source data, etc.) toat least one of the second pluralities of parity bits, as shown in ablock 1750.

The method 1700 then operates by arranging the first pluralities ofparity bits, the second pluralities of parity bits, and the one or morecontrol or extra bits thereby generating an output bit sequence, asshown in a block 1760. This output bit sequence then is employed togenerate a signal that is suitable for being launched into acommunication channel.

FIG. 17B illustrates an embodiment of a method 1701 for decodingprocessing of a product coded signal. Referring to method 1701 of FIG.17B, the method 1701 begins by performing column decoding of matrixformatted bits (e.g., corresponding to signal received fromcommunication channel) and recording which bits, if any, are flippedduring column decoding, as shown in a block 1711. The method 1701 thenoperates by updating matrix formatted bits to indicate flipped bits (ifany) based on column decoding, as shown in a block 1721.

The method 1701 continues by performing row decoding of updated matrixformatted bits (including any flipped bits) and recording whichadditional bits, if any, are flipped during column decoding, as shown ina block 1731. The method 1701 then operates by updating matrix formattedbits to indicate flipped bits (if any) based on row decoding, as shownin a block 1741. The method 1701 continues by employing most recentlyupdated matrix formatted bits to make estimates of information bitsencoded therein, as shown in a block 1751.

In this embodiment, it is noted that column decoding is performedfirstly and row decoding is performed secondly in a decoding iterationin this embodiment. In other embodiments, row decoding may instead beperformed firstly and column decoding may be performed secondly in agiven decoding iteration.

It is noted that the various modules (e.g., encoding modules, decodingmodules, symbol mappers, metric generators, etc.) described herein maybe a single processing device or a plurality of processing devices. Sucha processing device may be a microprocessor, micro-controller, digitalsignal processor, microcomputer, central processing unit, fieldprogrammable gate array, programmable logic device, state machine, logiccircuitry, analog circuitry, digital circuitry, and/or any device thatmanipulates signals (analog and/or digital) based on operationalinstructions. The operational instructions may be stored in a memory.The memory may be a single memory device or a plurality of memorydevices. Such a memory device may be a read-only memory, random accessmemory, volatile memory, non-volatile memory, static memory, dynamicmemory, flash memory, and/or any device that stores digital information.It is also noted that when the processing module implements one or moreof its functions via a state machine, analog circuitry, digitalcircuitry, and/or logic circuitry, the memory storing the correspondingoperational instructions is embedded with the circuitry comprising thestate machine, analog circuitry, digital circuitry, and/or logiccircuitry. In such an embodiment, a memory stores, and a processingmodule coupled thereto executes, operational instructions correspondingto at least some of the steps and/or functions illustrated and/ordescribed herein.

It is also noted that any of the connections or couplings between thevarious modules, circuits, functional blocks, components, devices, etc.within any of the various diagrams or as described herein may be of anytype as desired such as a direct connection, an indirection connection(e.g., with one or more intervening components there between), acommunicative coupling, etc. without departing from the scope and spiritof the invention.

Various aspects of the present invention have also been described abovewith the aid of method steps illustrating the performance of specifiedfunctions and relationships thereof. The boundaries and sequence ofthese functional building blocks and method steps have been arbitrarilydefined herein for convenience of description. Alternate boundaries andsequences can be defined so long as the specified functions andrelationships are appropriately performed. Any such alternate boundariesor sequences are thus within the scope and spirit of the claimedinvention.

Various aspects of the present invention have been described above withthe aid of functional building blocks illustrating the performance ofcertain significant functions. The boundaries of these functionalbuilding blocks have been arbitrarily defined for convenience ofdescription. Alternate boundaries could be defined as long as thecertain significant functions are appropriately performed. Similarly,flow diagram blocks may also have been arbitrarily defined herein toillustrate certain significant functionality. To the extent used, theflow diagram block boundaries and sequence could have been definedotherwise and still perform the certain significant functionality. Suchalternate definitions of both functional building blocks and flowdiagram blocks and sequences are thus within the scope and spirit of theclaimed invention.

One of average skill in the art will also recognize that the functionalbuilding blocks, and other illustrative blocks, modules and componentsherein, can be implemented as illustrated or by discrete components,application specific integrated circuits, processors executingappropriate software and the like or any combination thereof.

Moreover, although described in detail for purposes of clarity andunderstanding by way of the aforementioned embodiments, various aspectsof the present invention are not limited to such embodiments. It will beobvious to one of average skill in the art that various changes andmodifications may be practiced within the spirit and scope of theinvention, as limited only by the scope of the appended claims.

1. An apparatus, comprising: an input for receiving a signal from acommunication channel; a matrix formatting module for arranging aplurality of bits corresponding to the signal into a plurality of matrixformatted bits in accordance with a predetermined pattern; a pluralityof row decoders for decoding a plurality of rows of the plurality ofmatrix formatted bits thereby generating estimates of information bitsencoded within the plurality of rows; and a plurality of column decodersfor decoding a plurality of columns of the plurality of matrix formattedbits thereby generating estimates of information bits encoded within theplurality of columns; and wherein: when a row of the plurality of rowsbeing deemed un-decodable in a current decoding iteration, at least oneestimate of information bits encoded within the row from at least oneprior decoding iteration being selectively recovered for use insubsequent decoding performed by the plurality of column decoders. 2.The apparatus of claim 1, wherein: when a column of the plurality ofcolumns being deemed un-decodable in the current decoding iteration, atleast one estimate of information bits encoded within the column fromthe prior decoding iteration being selectively recovered for use insubsequent decoding performed by the plurality of row decoders.
 3. Theapparatus of claim 1, wherein: when the row of the plurality of rowsbeing deemed un-decodable in the current decoding iteration, theplurality of row decoders ignoring bits within the row affected by theplurality of column decoders from at least one prior decoding iteration.4. The apparatus of claim 1, wherein: a row or a column of the pluralityof matrix formatted bits includes a control bit that is a cyclicredundancy check (CRC) bit encoded therein or an extra parity bitencoded therein; and at least one of the plurality of row decoders andthe plurality of column decoders includes control bit functionality forprocessing the at least one row or at least one column of the pluralityof matrix formatted bits thereby generating an estimate of the controlbit.
 5. The apparatus of claim 1, wherein: each row and each column ofthe plurality of matrix formatted bits includes at least one respectivecontrol bit that is a cyclic redundancy check (CRC) bit encoded thereinor an extra parity bit encoded therein; and at least one of theplurality of row decoders and the plurality of column decoders includescontrol bit functionality for processing each row and each column of theplurality of matrix formatted bits thereby generating estimates of therespective CRC bits encoded therein.
 6. The apparatus of claim 1,wherein: the plurality of bits corresponding to the signal, includinginformation bits encoded therein in accordance with forward errorcorrection (FEC) coding, includes an overall redundancy beingapproximately 7%.
 7. The apparatus of claim 1, wherein: information bitswithin at least one row or at least one column of the plurality ofmatrix formatted bits being encoded using a BCH (Bose and Ray-Chaudhuri,and Hocquenghem) code or a Reed-Solomon (RS) code.
 8. The apparatus ofclaim 1, wherein: estimates of information bits encoded within one ofthe plurality of rows, as generated by the plurality of row decoders,being employed to modify a first information bit encoded within a firstof the plurality of columns and a second information bit encoded withina second of the plurality of columns.
 9. The apparatus of claim 1,wherein: at least one additional apparatus, communicatively coupled tothe apparatus via a communication channel, that performs encoding, byemploying a BCH (Bose and Ray-Chaudhuri, and Hocquenghem) code or aReed-Solomon (RS) code, of a plurality of information bits therebygenerating a plurality of coded bits; and the at least one additionalapparatus employing the plurality of coded bits thereby generating thesignal and launching the signal into the communication channel.
 10. Theapparatus of claim 1, wherein: the apparatus being a communicationdevice; and the communication device being operative within at least oneof a satellite communication system, a wireless communication system, awired communication system, and a fiber-optic communication system. 11.An apparatus, comprising: an input for receiving a signal from acommunication channel; a matrix formatting module, communicativelycoupled to the input, for arranging a plurality of bits corresponding tothe signal into a plurality of matrix formatted bits in accordance witha predetermined pattern such that each row and each column of theplurality of matrix formatted bits includes at least one respectivecontrol bit that is a cyclic redundancy check (CRC) bit encoded thereinor an extra parity bit encoded therein; a plurality of row decoders fordecoding a plurality of rows of the plurality of matrix formatted bitsthereby generating estimates of information bits encoded within theplurality of rows, wherein the plurality of row decoders includes firstcontrol bit functionality for generating estimates of the respectivecontrol bits encoded within the plurality of rows; and a plurality ofcolumn decoders for decoding a plurality of columns of the plurality ofmatrix formatted bits thereby generating estimates of information bitsencoded within the plurality of columns, wherein the plurality of columndecoders includes second control bit functionality for generatingestimates of the respective control bits encoded within the plurality ofcolumns; and wherein: when a row of the plurality of rows being deemedun-decodable in a current decoding iteration: at least one estimate ofinformation bits encoded within the row from at least one prior decodingiteration being selectively recovered for use in subsequent decodingperformed by the plurality of column decoders; and the plurality of rowdecoders ignoring bits within the row affected by the plurality ofcolumn decoders from at least one prior decoding iteration.
 12. Theapparatus of claim 11, wherein: the plurality of bits corresponding tothe signal, including information bits encoded therein in accordancewith forward error correction (FEC) coding, includes an overallredundancy being approximately 7%.
 13. The apparatus of claim 11,wherein: information bits within at least one row or at least one columnof the plurality of matrix formatted bits being encoded using a BCH(Bose and Ray-Chaudhuri, and Hocquenghem) code or a Reed-Solomon (RS)code.
 14. The apparatus of claim 11, wherein: the apparatus being acommunication device; and the communication device being operativewithin at least one of a satellite communication system, a wirelesscommunication system, a wired communication system, and a fiber-opticcommunication system.
 15. A method, comprising: receiving a signal froma communication channel; arranging a plurality of bits corresponding tothe signal into a plurality of matrix formatted bits in accordance witha predetermined pattern; operating a plurality of row decoders fordecoding a plurality of rows of the plurality of matrix formatted bitsthereby generating estimates of information bits encoded within theplurality of rows; operating a plurality of column decoders for decodinga plurality of columns of the plurality of matrix formatted bits therebygenerating estimates of information bits encoded within the plurality ofcolumns; and when a row of the plurality of rows being deemedun-decodable in a current decoding iteration, selectively recovering atleast one estimate of information bits encoded within the row from atleast one prior decoding iteration for use in subsequent decodingperformed by the plurality of column decoders.
 16. The method of claim15, further comprising: when a column of the plurality of columns beingdeemed un-decodable in the current decoding iteration, selectivelyrecovering at least one estimate of information bits encoded within thecolumn from the prior decoding iteration for use in subsequent decodingperformed by the plurality of row decoders.
 17. The method of claim 15,wherein: when the row of the plurality of rows being deemed un-decodablein the current decoding iteration, operating the plurality of rowdecoders thereby ignoring bits within the row affected by the pluralityof column decoders from at least one prior decoding iteration.
 18. Themethod of claim 15, wherein: the plurality of bits corresponding to thesignal, including information bits encoded therein in accordance withforward error correction (FEC) coding, includes an overall redundancybeing approximately 7%.
 19. The method of claim 15, further comprising:encoding information bits within at least one row or at least one columnof the plurality of matrix formatted bits using a BCH (Bose andRay-Chaudhuri, and Hocquenghem) code or a Reed-Solomon (RS) code. 20.The method of claim 15, wherein: the method being performed within acommunication device; and the communication device being operativewithin at least one of a satellite communication system, a wirelesscommunication system, a wired communication system, and a fiber-opticcommunication system.